A Novel Spatial Interpolation Parallel Algorithm based on Genetic Expression Programming

نویسندگان

  • Dongmei Zhang
  • Yang Li
  • Chengjun Li
  • Jianquan Bao
چکیده

Because of the limited environmental monitoring stations, the spatial data we have obtained by monitoring is local, discrete and limited. Therefore, speculating the environmental pollution parameters without monitoring station by using known monitoring data for spatial interpolation has become a hot research topic. In our preliminary work, an approach combining Genetic Expression Programming (GEP) evolution modeling with Delaunay, is presented to achieve automatic spatial interpolation. However, as a kind of genetic, GEP has the problem of premature convergence. In this paper, a GEP combining parallel algorithm based on MPI is proposed. By adopting the master-slave coarseness parallel GEP algorithm for spatial interpolation and introducing the subgroups migrating policy based on ring topology, this proposed algorithm has realized the coarseness scalable parallel computing which can run in the processor within a certain size to raise the ability of jumping out of the local optimum thus can avoid the problem of premature convergence efficiently. The result of simulation experiment shows that, as to the normal dataset and abnormal dataset of SIC2004, the GEP parallel algorithm based on MPI has the same predictable accuracy as the serial algorithms do, and the execution time is much less than serial algorithm, which can better satisfy the real-time demand of monitoring the content of radioactive material.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

متن کامل

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

متن کامل

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...

متن کامل

A Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011